non-blocking synchronization

См. также в других словарях:

• Non-blocking synchronization — In computer science, non blocking synchronization ensures that threads competing for a shared resource do not have their execution indefinitely postponed by mutual exclusion. Literature up to the turn of the century used non blocking synonymously …   Wikipedia

• Non-blocking — may refer to: Non blocking I/O Non blocking synchronization This disambiguation page lists articles associated with the same title. If an internal link led you here, you may wish to change the link to point directly to the int …   Wikipedia

• Non-blocking algorithm — In computer science, a non blocking algorithm ensures that threads competing for a shared resource do not have their execution indefinitely postponed by mutual exclusion. A non blocking algorithm is lock free if there is guaranteed system wide… …   Wikipedia

• Synchronization (computer science) — In computer science, synchronization refers to one of two distinct but related concepts: synchronization of processes, and synchronization of data. Process synchronization refers to the idea that multiple processes are to join up or handshake at… …   Wikipedia

• Blocking (scheduling) — In a multitasking computer system, individual tasks, or threads of execution, must share the resources of the system. These resources might be:* the CPU * network * memory * diskor any other shared resource.When one task is using a resource, it… …   Wikipedia

• Non-Uniform Memory Access — (NUMA) is a computer memory design used in Multiprocessing, where the memory access time depends on the memory location relative to a processor. Under NUMA, a processor can access its own local memory faster than non local memory, that is, memory …   Wikipedia

• Lock-free and wait-free algorithms — In contrast to algorithms that protect access to shared data with locks, lock free and wait free algorithms are specially designed to allow multiple threads to read and write shared data concurrently without corrupting it. Lock free refers to the …   Wikipedia

• Read-copy-update — (RCU) is an operating system kernel technology for improving performance on computers with more than one CPU.More technically it is a synchronization mechanism which can sometimes be used as an alternative to a readers writer lock. It allows… …   Wikipedia

• Lock (computer science) — In computer science, a lock is a synchronization mechanism for enforcing limits on access to a resource in an environment where there are many threads of execution. Locks are one way of enforcing concurrency control policies. Contents 1 Types 2… …   Wikipedia

• Type Stable Memory Management — refers to the concept of maintaining type between memory allocation and deallocation. This idea is extremely useful in constructing non blocking synchronization algorithms. The below image describes an algorithm detailing the use of type stable… …   Wikipedia

• Embedded system — Picture of the internals of an ADSL modem/router. A modern example of an embedded system. Labelled parts include a microprocessor (4), RAM (6), and flash memory (7). An embedded system is a computer system designed to do one or a few dedicated… …   Wikipedia